Parallel prefix polymorphism permits parallelization, presentation & proof
نویسندگان
چکیده
Polymorphism in programming languages enables code reuse. Here, we show that polymorphism has broad applicability far beyond computations for technical computing: parallelism in distributed computing, presentation of visualizations of runtime data flow, and proofs for formal verification of correctness. The ability to reuse a single codebase for all these purposes provides new ways to understand and verify parallel programs.
منابع مشابه
Approaching Symbolic Parallelization by Synthesis of Recurrence Decompositions
We present GRASSP, a novel approach to perform automated parallelization relying on recent advances in formal verification and synthesis. GRASSP augments an existing sequential program with an additional functionality to decompose data dependencies in loop iterations, to compute partial results, and to compose them together. We show that for some classes of the sequential prefix sum problems, s...
متن کاملA Logic for Parametric Polymorphism
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed -calculus with recursion and arithmetic, our logic is a logic for System F. The logic permits the formal presentation and use of relational parametricity. Parametricity yields|for example|encodings of initial algebras, nal co-algebras and abstract datatypes, with corresponding proof princ...
متن کاملConstructing Zero-deficiency Parallel Prefix Circuits of Minimum Depth
A parallel prefix circuit has n inputs x1, x2, . . . , xn, and computes the n outputs yi = xi • xi−1 • · · ·•x1, 1 ≤ i ≤ n, in parallel, where • is an arbitrary binary associative operator. Snir proved that the depth t and size s of any parallel prefix circuit satisfy the inequality t + s ≥ 2n − 2. Hence, a parallel prefix circuit is said to be of zero-deficiency if equality holds. In this pape...
متن کاملMixed Large-Eddy Simulation Model for Turbulent Flows across Tube Bundles Using Parallel Coupled Multiblock NS Solver
In this study, turbulent flow around a tube bundle in non-orthogonal grid is simulated using the Large Eddy Simulation (LES) technique and parallelization of fully coupled Navier – Stokes (NS) equations. To model the small eddies, the Smagorinsky and a mixed model was used. This model represents the effect of dissipation and the grid-scale and subgrid-scale interactions. The fully coupled NS eq...
متن کاملMixed Large-Eddy Simulation Model for Turbulent Flows across Tube Bundles Using Parallel Coupled Multiblock NS Solver
In this study, turbulent flow around a tube bundle in non-orthogonal grid is simulated using the Large Eddy Simulation (LES) technique and parallelization of fully coupled Navier – Stokes (NS) equations. To model the small eddies, the Smagorinsky and a mixed model was used. This model represents the effect of dissipation and the grid-scale and subgrid-scale interactions. The fully coupled NS eq...
متن کامل